Fingerprint identification using graph matching
نویسندگان
چکیده
Abstract--A new algorithm for automated fingerprint encoding and matching is presented. The algorithm is intended to be insensitive to imperfections introduced during fingerprint registration, such as noise. distortion and displacement. A fingerprint is represented in the form of a graph whose nodes correspond to ridges in the print. Edges of the graph connect nodes that represent neighboring or intersecting ridges. Hence the graph structure captures the topological relationships within the fingerprint. The algorithm has been implemented and tested using a library of real-life fingerprint images.
منابع مشابه
Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
The increasing availability and use of biometric data leads to situations when sensitive biometric data is to be handled by entities who may not be fully trusted or otherwise are not authorized to have full access to such data. This calls for mechanisms of provably protecting biometric data while still allowing the computation to take place. Our focus is on privacy-preserving matching of two fi...
متن کاملLocal and Global Tree Graph Structures for Fingerprint Verification
We introduce fingerprint verification, one of the most reliable personal identification methods in the biometric technology. In this paper, a new approach to the fingerprint verification based on tree graph construction is presented. Initially we find all possible minutiae points, followed by two levels of matching. At the first level match a local tree graph structure (LTGS) is constructed for...
متن کاملSecure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
The increasing availability and use of biometric data for authentication and other purposes leads to situations when sensitive biometric data is to be handled or used in computation by entities who may not be fully trusted or otherwise are not authorized to have full access to such data. This calls for mechanisms of provably protecting biometric data while still allowing the computation to take...
متن کاملFingerprints: Orientation Free Minutiae Extraction and Using Distances between Minutiae for Identification and Verification
Fingerprint recognition has become a standard in both access control and forensics. This is because fingerprints are unique to an individual. While there are many ways in which a fingerprint can be recognised one of the most common is to look at the endings and splitting of the ridges. These are called minutiae. This research undertakes to improve upon existing methods used in all parts of a mi...
متن کاملAltered Fingerprint Matching Using Ridge Texture and Frequency in the Unaltered Region
ISSN: 2277-503X| © 2015 Bonfring Abstract--Fingerprint alteration is the process of changing the regularly spaced ridge structure by mechanical or chemical means to hide the identity from Automated Fingerprint Identification System. This paper presents a method for altered fingerprint matching using texture and ridge frequency in the unaltered region. Wavelet transform is used to create feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 19 شماره
صفحات -
تاریخ انتشار 1986